Correlation of Pseudorandom Binary Sequences from de Bruijn Graphs
نویسنده
چکیده
Binary sequences with good correlation properties play an important role in many secure communication systems and testing of systems. In this paper, we describe and illustrate sets of pseudorandom sequences from de Bruijn graphs which have good correlation functions and critically analyze how we investigate all homomorphisms that give low correlation values between the binary sequences. We compute their correlation functions, which for certain nontrivial homomorphisms turn out to be asymptotically within a factor of 2.5 of the Welch bound. AMS subject classification: 68R01, 68R10, 05C38.
منابع مشابه
Binary De Bruijn sequences for DS-CDMA systems: analysis and results
Code division multiple access (CDMA) using direct sequence (DS) spread spectrum modulation provides multiple access capability essentially thanks to the adoption of proper sequences as spreading codes. The ability of a DSCDMA receiver to detect the desired signal relies to a great extent on the auto-correlation properties of the spreading code associated to each user; on the other hand, multi-u...
متن کاملA Point of Tangency Between Combinatorics and Differential Geometry
Edges of de Bruijn graphs whose labelled vertices are arranged in sequential order on a circle envelop epicycloids. 1. de BRUIJN SEQUENCES AND GRAPHS. The binary word
متن کاملColouring of cycles in the de bruijn graphs
We show that the problem of finding the family of all so called the locally reducible factors in the binary de Bruijn graph of order k is equivalent to the problem of finding all colourings of edges in the binary de Bruijn graph of order k − 1, where each vertex belongs to exactly two cycles of different colours. In this paper we define and study such colouring for the greater class of the de B...
متن کاملAn Unoriented Variation on de Bruijn Sequences
For positive integers k, n, a de Bruijn sequence B(k, n) is a finite sequence of elements drawn from k characters whose subwords of length n are exactly the k words of length n on k characters. This paper introduces the unoriented de Bruijn sequence uB(k, n), an analog to de Bruijn sequences, but for which the sequence is read both forwards and backwards to determine the set of subwords of leng...
متن کاملFixed-density De Bruijn Sequences
De Bruijn sequences are circular strings of length 2 whose substrings are the binary strings of length n. Our focus is on de Bruijn sequences for binary strings that have the same density (number of 1s). We construct circular strings of length ( n−1 d )
متن کامل